A family of matrix-tree multijections
نویسندگان
چکیده
For a natural class of $r \times n$ integer matrices, we construct non-convex polytope which periodically tiles $\mathbb R^n$. From this tiling, provide family geometrically meaningful maps from generalized sandpile group to set spanning trees give multijective proofs for several higher-dimensional matrix-tree theorems. In particular, these multijections can be applied graphs, regular matroids, cell complexes with torsion-free forest, and representable arithmetic matroids multiplicity one basis. This generalizes bijection given by Backman, Baker, Yuen extends work Duval, Klivans, Martin.
منابع مشابه
A Family of Matrix Problems
where C(x) = 1 − 3x + x 2 /2 + x 3 /30. Note that C (x) is positive for x > 3 and C(9/2) = 53/80. Hence C(x) is positive for x > 9/2 and the bounds are established. We can now write F (z) > z 2 0 e −zt dt + z ∞ 2 2t 2 e −(z+1)t dt, and thus F (z) > 1 + e −2z−2 (w(z) − e 2), where w(z) = 8 − 4 (z + 1) 2 − 4 (z + 1) 3. Note that w(z) increases from 200/27 at z = 2 to 8 at z = ∞. Since 200/27 > e ...
متن کاملProduct distance matrix of a tree with matrix weights
Let T be a tree on n vertices and let the n− 1 edges e1, e2, . . . , en−1 have weights that are s× s matrices W1,W2, . . . ,Wn−1, respectively. For two vertices i, j, let the unique ordered path between i and j be pi,j = er1er2 . . . erk . Define the distance between i and j as the s × s matrix Ei,j = ∏k p=1Wep . Consider the ns × ns matrix D whose i, j-th block is the matrix Ei,j . We give a f...
متن کاملThe distance matrix of a bidirected tree
We refer to [4], [8] for basic definitions and terminology in graph theory. A tree is a simple connected graph without any circuit. We consider trees in which each edge is replaced by two arcs in either direction. In this paper, such trees are called bidirected trees. We now introduce some notation. Let e,0 be the column vectors consisting of all ones and all zeros, respectively, of the appropr...
متن کاملReducing the Adjacency Matrix of a Tree
Let T be a tree, A its adjacency matrix, and a scalar. We describe a linear-time algorithm for reducing the matrix In +A. Applications include computing the rank of A, nding a maximum matching in T , computing the rank and determinant of the associated neighborhood matrix, and computing the characteristic polynomial of A.
متن کاملAround Matrix-tree Theorem
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system Dn (the classical theorem corresponds to the An-case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2021
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.181